Euler path

См. также в других словарях:

• Euler spiral — A double end Euler spiral. An Euler spiral is a curve whose curvature changes linearly with its curve length (the curvature of a circular curve is equal to the reciprocal of the radius). Euler spirals are also commonly referred to as spiros,… …   Wikipedia

• Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… …   Wikipedia

• Euler-Lagrange-Gleichung — Der Lagrange Formalismus ist eine 1788 von Joseph Louis Lagrange eingeführte Formulierung der klassischen Mechanik, in der die Dynamik eines Systems durch eine einzige skalare Funktion, die Lagrangefunktion, beschrieben wird. Dadurch wird… …   Deutsch Wikipedia

• Euler-Lagrange-Gleichungen — Der Lagrange Formalismus ist eine 1788 von Joseph Louis Lagrange eingeführte Formulierung der klassischen Mechanik, in der die Dynamik eines Systems durch eine einzige skalare Funktion, die Lagrangefunktion, beschrieben wird. Dadurch wird… …   Deutsch Wikipedia

• Euler hypergeometric integral — In mathematics, the Euler hypergeometric integral is a representation of the hypergeometric function by means of an integral. It is given by:; 2F 1(a,b;c;z)=frac{Gamma(c)}{Gamma(b) Gamma(c b)}int 0^1 frac{dw} {w^{1 b} ; (1 w)^{1 c+b} ;(1 zw)^a}… …   Wikipedia

• List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

• Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the …   Wikipedia

• Leonhard Euler — Infobox Scientist name = Leonhard Euler|box width = 300px |200px image width = 200px caption = Portrait by Johann Georg Brucker birth date = birth date|df=yes|1707|4|15 birth place = Basel, Switzerland death date = 18 September (O.S 7 September)… …   Wikipedia

• Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron …   Wikipedia

• эйлеров маршрут — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN euler path …   Справочник технического переводчика

• NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… …   Wikipedia